ient Mapping for S ore of String Mat hing
نویسندگان
چکیده
Abstra t. This paper proposes an e ient algorithm to solve the problem of string mat hing with mismat hes. For a text of length n and a pattern of length m over an alphabet , the problem is known to be solved in O(j jn logm) time by omputing a s ore by the fast Fourier transformation (FFT). Atallah et al. introdu ed a randomized algorithm in whi h the time omplexity an be de reased by the trade-o with the a ura y of the estimates for the s ore. The algorithm in the present paper yields an estimate with smaller varian e ompared to that the algorithm by Atallah et al., moreover, and omputes the exa t s ore in O(j jn logm) time. The present paper also gives two methods to improve the algorithm and an exa t estimation of the varian e of the estimates for the s ore.
منابع مشابه
Mapping for S ore of String Mat hing
Abstra t. This paper proposes an e ient algorithm to solve the problem of string mat hing with mismat hes. For a text of length n and a pattern of length m over an alphabet , the problem is known to be solved in O(j jn logm) time by omputing a s ore by the fast Fourier transformation (FFT). Atallah et al. introdu ed a randomized algorithm in whi h the time omplexity an be de reased by the trade...
متن کاملMat hing Numeri Strings under Noise
Abstra t. Numeri string is a sequen e of symbols from an alphabet U, where U is some numeri al universe losed under addition and subtra tion. Given two numeri strings A = a 1 a m and B = b 1 b n and a distan e fun tion d(A;B) that gives the s ore of the best (partial) mat hing of A and B, the transposition invariant distan e is min t2U fd(A + t; B)g, where A + t = (a 1 + t)(a 2 + t) : : : (a m ...
متن کاملMatching Numeric Strings under Noise
Abstra t. Numeri string is a sequen e of symbols from an alphabet U, where U is some numeri al universe losed under addition and subtra tion. Given two numeri strings A = a 1 a m and B = b 1 b n and a distan e fun tion d(A;B) that gives the s ore of the best (partial) mat hing of A and B, the transposition invariant distan e is min t2U fd(A + t; B)g, where A + t = (a 1 + t)(a 2 + t) : : : (a m ...
متن کاملString Mat hing with Gaps for Musi al Melodi Re
Abstra t. Here, we have designed and implemented algorithms for string mat hing with gaps for musi al melodi re ognition on polyphoni musi using bit-wise operations. Musi analysts are often on erned with nding o urren es of patterns (motifs), or repetitions of the same pattern, possibly with variations, in a s ore. An important example of exibility required in s ore sear hing arises from the na...
متن کاملA Note on Randomized Algorithm for String Mat hing with Mismat hes
Abstra t. Atallah et al. [ACD01℄ introdu ed a randomized algorithm for string mat hing with mismat hes, whi h utilized fast Fourier transformation (FFT) to ompute onvolution. It estimates the s ore ve tor of mat hes between text string and a pattern string, i.e. the ve tor obtained when the pattern is slid along the text, and the number of mat hes is ounted for ea h position. In this paper, we ...
متن کامل